Designing content distribution networks for optimal cost and performance

نویسندگان

  • Jason Deane
  • Terry R. Rakes
  • Anurag Agarwal
چکیده

One strategy for alleviating excess latency (delay) in the Internet is the caching of web content at multiple locations. This reduces the number of hops necessary to reach the desired content. This strategy is used for web content such as html pages, images, streaming video, and Internet radio. The network of servers which store this content, and the collections of objects stored on each server, is called a content distribution network (CDN). In order to optimally design a CDN, given a network topology with available server storage capacity at various points in the network, one must decide which object collections to place on each server in order to achieve performance or cost objectives. The placements must be within the storage limits of the servers and must reflect the request patterns for each collection of objects to be cached. Researchers have suggested formulations for the CDN problem which address performance by minimizing latency (the average number of hops is a commonly accepted measure of latency) from client to content, or formulations that focus on minimizing cost of storage and/or bandwidth. In this research, we develop a model which allows for the simultaneous treatment of performance and cost, present examples to illustrate the application of the model and perform a detailed designed experiment to gain insights into cost/hops tradeoff for a variety of network parameters.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improve Replica Placement in Content Distribution Networks with Hybrid Technique

The increased using of the Internet and its accelerated growth leads to reduced network bandwidth and the capacity of servers; therefore, the quality of Internet services is unacceptable for users while the efficient and effective delivery of content on the web has an important role to play in improving performance. Content distribution networks were introduced to address this issue. Replicatin...

متن کامل

A mathematical model for designing optimal urban gas networks, an ant colony algorithm and a case study

Considering the high costs of the implementation and maintenance of gas distribution networks in urban areas, optimal design of such networks is vital. Today, urban gas networks are implemented within a tree structure. These networks receive gas from City Gate Stations (CGS) and deliver it to the consumers. This study presents a comprehensive model based on Mixed Integer Nonlinear Programming (...

متن کامل

Optimal Design of a Hybrid Wind-Photovoltaic-Hydroelectric Electricity Generating System in the Presence of Battery Storage: GSO Algorithm

In this study, we will investigate the possibility of using renewable energy resources in area where electrical energy is not supported. We will consider it as a micro-grid and we will try to supply its electrical energy by decreasing cost and having reliability in system. Generally, the main reason of designing and developing of distribution grid is responsible to growth of electrical consumpt...

متن کامل

Optimal Distributed Generation Planning in Radial Distribution Networks Considering Protection Coordination Limits

Distributed generation (DG) has been widely used in distribution network to reduce the energy losses, improve voltage profile and system reliability, etc.  The location and capacity of DG units can influence on probability of protection mal-operation in distribution networks. In this paper, a novel model for DG planning is proposed to find the optimum DG location and sizing in radial distr...

متن کامل

A Novel Method for Designing and Optimization of Networks

In this paper, system planning network is formulated with mixed-integer programming. Two meta-heuristic procedures are considered for this problem. The cost function of this problem consists of the capital investment cost in discrete form, the cost of transmission losses and the power generation costs. The DC load flow equations for the network are embedded in the constraints of the mathematica...

متن کامل

A Multi Objective Fibonacci Search Based Algorithm for Resource Allocation in PERT Networks

The problem we investigate deals with the optimal assignment of resources to the activities of a stochastic project network. We seek to minimize the expected cost of the project include sum of resource utilization costs and lateness costs. We assume that the work content required by the activities follows an exponential distribution. The decision variables of the model are the allocated resourc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Information Technology and Management

دوره 13  شماره 

صفحات  -

تاریخ انتشار 2012